Abstract Steiner Points for Convex Polytopes

نویسنده

  • CHRISTIAN BERG
چکیده

STEINER POINTS FOR CONVEX POLYTOPES CHRISTIAN BERG Let & denote the set of all convex polytopes, degenerate or not, in ^-dimensional Euclidean space E. An abstract Steiner point for convex polytopes in E is a mapping S:2P-+E satisfying S(P+Q) = S(P) + S(Q) for all P, Qe0*, (1) addition on the left being Minkowski addition of convex sets, and S{a(P)) = o{S(P)) (2) for all Pe&* and all similarity transformations a in E. (A similarity means any composition of dilatations and isometries.) In the present paper we shall characterize the abstract Steiner points for convex polytopes in two and three dimensions. As a simple consequence of this characterization we find that an abstract Steiner point S for convex polytopes in E, d = 2,3, satisfying S(P) e P for all P e &, is the usual Steiner point. For the definition and properties of this point see [3]. For any vertex A of Pe^} let V(A) denote the closed convex spherical polytope in S~, consisting of all outer normal directions for supporting hypeiplanes of P through A. The external angle u at the vertex A is now defined as u = o)(V(A)), where a> denotes the normalized surface measure of S~. Let \i be any mapping from the set "T~ of closed convex spherical polytopes in S~ to the real numbers satisfying (3) whenever V, W, V u Wcf', and the polytopes V and W are without common interior points, n(6(V)) = n(V), (4) for all isometries 8 of S", and niS"-) = 1. (5) The set of all these mappings /J will be denoted by M. For any /jeMwe define an abstract Steiner point S^ by the formula SP(P) = Z ^(K04,))pf, (6) where pt denotes the position vector of the vertex Ah (i = 1,..., n) of Pe^ . For the proof of (1) and (2) for Ŝ see [ 3; p. 1296]. Examples of such mappings \i are obtained as follows. Let O denote the set of functions (j>: [0,1] -* R satisfying (u + v) = 4>{u)+(v) (7) Received 26 February, 1970; revised 30 October, 1970. [J. LONDON MATH. SOC. (2), 4 (1971), 176-180] ABSTRACT STEINER POINTS FOR CONVEX POLYTOPES 177STEINER POINTS FOR CONVEX POLYTOPES 177 whenever w, v, u + ve [0,1], and

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimum Convex Partitions and Maximum Empty Polytopes

Let S be a set of n points in Rd. A Steiner convex partition is a tiling of conv(S) with empty convex bodies. For every integer d, we show that S admits a Steiner convex partition with at most ⌈(n − 1)/d⌉ tiles. This bound is the best possible for points in general position in the plane, and it is best possible apart from constant factors in every fixed dimension d ≥ 3. We also give the first c...

متن کامل

Small Stri tly Convex Quadrilateral Meshes of Point Sets

Abstract In this paper, we give upper and lower bounds on the number of Steiner points required to onstru t a stri tly onvex quadrilateral mesh for a planar point set. In parti ular, we show that 3⌊ 2 ⌋ internal Steiner points are always suÆ ient for a onvex quadrilateral mesh of n points in the plane. Furthermore, for any given n ≥ 4, there are point sets for whi h ⌈ 2 ⌉ − 1 Steiner points are...

متن کامل

Quotients of the Multiplihedron as Categorified Associahedra

Abstract We describe a new sequence of polytopes which characterize A∞-maps from a topological monoid to an A∞-space. Therefore each of these polytopes is a quotient of the corresponding multiplihedron. Our sequence of polytopes is demonstrated not to be combinatorially equivalent to the associahedra, as was previously assumed in both topological and categorical literature. They are given the n...

متن کامل

ar X iv : 0 70 6 . 41 78 v 1 [ m at h . C O ] 2 8 Ju n 20 07 Lattice polytopes of degree 2 Jaron Treutlein

Abstract. A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly i > 0 interior lattice points. We give a new proof for this theorem and classify polygons with maximal volume. Then we show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimension. From a theorem of Victor Batyrev the finiteness of ...

متن کامل

ar X iv : 0 70 6 . 41 78 v 2 [ m at h . C O ] 2 1 Fe b 20 08 Lattice Polytopes of Degree 2

Abstract. A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly i > 0 interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in higher dimensions. The finiteness of lattice polytopes of degree 2 up to standard pyramids and affine unimodular transformation follows from a theore...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006